Partial Combinatory Algebras of Functions
نویسنده
چکیده
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley’s preorder-enriched category of partial combinatory algebras and decidable applicative structures. We also investigate total combinatory algebras of partial functions. One of the results is, that every realizability topos is a quotient of a realizability topos on a total combinatory algebra. AMS Subject Classification (2000): 03B40,68N18
منابع مشابه
Total Maps of Turing Categories
We give a complete characterization of those categories which can arise as the subcategory of total maps of a Turing category. A Turing category provides an abstract categorical setting for studying computability: its (partial) maps may be described, equivalently, as the computable maps of a partial combinatory algebra. The characterization, thus, tells one what categories can be the total func...
متن کاملRAPPORT Completing partial combinatory algebras with unique head - normal forms
In this note, we prove that having unique head-normal forms is a suucient condition on partial combinatory algebras to be completable. As application, we show that the pca of strongly normalizing CL-terms as well as the pca of natural numbers with partial recursive function application can be extended to total combinatory algebras.
متن کاملCompleting Partial Combinatory Algebras With Unique Head-Normal Forms
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application, we show that the pca of strongly normalizing CL-terms as well as the pca of natural numbers with partial recursive function application can be extended to total combinatory algebras.
متن کاملA Note on Absolutely Unorderable Combinatory Algebras
Plotkin [16] has conjectured that there exists an absolutely unorderable combinatory algebra, namely a combinatory algebra which cannot be embedded in another combinatory algebra admitting a non-trivial compatible partial order. In this paper we prove that a wide class of combinatory algebras admits extensions with a non-trivial compatible partial order.
متن کاملRealizability interpretation of PA by iterated limiting PCA
For any partial combinatory algebra (pca for short) A, the class of A-representable partial functions from N to A quotiented by the filter of cofinite sets of N, is a pca such that the representable partial functions are exactly the limiting partial functions of A-representable partial functions (Akama, “Limiting partial combinatory algebras” Theoret. Comput. Sci. Vol. 311 2004). The n-times it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 52 شماره
صفحات -
تاریخ انتشار 2011